The Average-Case Analysis of Some On-Line Algorithms for Bin Packing
نویسنده
چکیده
منابع مشابه
Multidimensional On-Line Bin-Packing: An Algorithm and its Average-Case Analysis
We describe an algorithm for on-line d-dimensional bin packing which achieves O(n d+1 d+2) average wasted space. This algorithm runs in linear time in the number of items packed.
متن کاملImproved Space for Bounded-Space, On-Line Bin-Packing
The author presents a sequence of linear-time, bounded-space, on-line, bin-packing algorithms that are based on the "HARMONIC" algorithms Hk introduced by Lee and Lee [J. Assoc. Comput. Mach., 32 (1985), pp. 562-572 ]. The algorithms in this paper guarantee the worst case performance of Hk, whereas they only use O(log log k) instead ofk active bins. For k >_6, the algorithms in this paper outpe...
متن کاملOn Variable-Sized Bin Packing
In variable sized bin packing, a number of bin types are given and the goal is to pack a list of items by choosing appropriate bins such that the total size of bins used is minimized. In this paper, we present absolute worst-case analysis for on-line algorithms. Then we consider an related problem: how to design k different bin sizes such that for any item list the waste space of bins used is m...
متن کاملThe Ordered Open-End Bin-Packing Problem
We study a variant of the classical bin-packing problem, the ordered open-end bin-packing problem, where first a bin can be filled to a level above 1 as long as the removal of the last piece brings the bin’s level back to below 1 and second, the last piece is the largest-indexed piece among all pieces in the bin. We conduct both worst-case and average-case analyses for the problem. In the worst...
متن کاملMultiple Destination Bin Packing
There exists ample literature about on-line and off-line algorithms to solve the two and three dimensional bin packing problem. However, non of the off-line algorithms presented in literature are designed for the case that there are constraints on the order in which the objects have to be removed from the bin. This constraint is relevant in the case that we are loading a truck with several orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1984